Reasoning about real-time programs using idle-invariant assertions
نویسنده
چکیده
We develop a set of laws for reasoning about real-time programs using assertions (preconditions and postconditions) in the style of Hoare. In the real-time context assertions may refer to the current time and to the value of external inputs, which are not under the direct control of the program and hence not guaranteed to be stable with respect to the passage of time (even if the program does not modify any of the variables under its control). Hence in order to reason about real-time programs, we make use of idle-invariant assertions: assertions that are invariant to just the passage of time.
منابع مشابه
Reasoning About Time in Higher-Level Language Software
A methodology for specifying and proving assertions about time in higher-level language programs is described. The approach develops three ideas: the distinction between, and treatment of, both real time and computer times; the use of upper and lower bounds on the execution times of program elements; and a simple extension of Hoare logic to include the eeects of the passage of real time. Schema...
متن کاملGeneration of Loop Invariants in Theorema by Combinatorial and Algebraic Methods
When generating verification conditions for a program, one is faced with one major task, namely with the situation when some additional assertions are needed (e.g. loop invariants). These assertions have the property that either they are invariant during execution of the program, or they depend on some other invariant properties. Therefore, automated formal verification is sensitive to the auto...
متن کاملA Trace Model for Pointers and Objects
Object-oriented programs [Dahl, Goldberg, Meyer] are notoriously prone to the following kinds of error, which could lead to increasingly severe problems in the presence of tasking 1. Following a null pointer 2. Deletion of an accessible object 3. Failure to delete an inaccessible object 4. Interference due to equality of pointers 5. Inhibition of optimisation due to fear of (4) Type disciplines...
متن کاملLightweight Separation
Lightweight separation is a novel approach to automatic reasoning about memory updates in pointer programs. It replaces the spatial formulae of separation logic, which complicate automation, by independent assertions about the memory content and the memory layout. As a result, assertions about the content can be treated by existing reasoners. The effect of memory updates is evaluated using spec...
متن کاملA Quantifier-Elimination Based Heuristic for Automatically Generating Inductive Assertions for Programs
A method using quantifier-elimination is proposed for automatically generating program invariants/inductive assertions. Given a program, inductive assertions, hypothesized as parameterized formulas in a theory, are associated with program locations. Parameters in inductive assertions are discovered by generating constraints on parameters by ensuring that an inductive assertion is indeed preserv...
متن کامل